翻訳と辞書 Words near each other ・ Lawil S.p.A. ・ Lawin ・ Lawing ・ Lawing, Alaska ・ Lawing, Sarawak ・ Lawitz ・ Lawkananda Pagoda ・ Lawkland ・ LAWKS ・ Lawksawk ・ Lawksawk State ・ Lawksawk Township ・ Lawledge railway station ・ Lawledge, Manitoba ・ Lawler ・ Lawler's algorithm ・ Lawler's Tavern ・ Lawler, Iowa ・ Lawler, Minnesota ・ Lawlers ・ Lawlers Airport ・ Lawlers Gold Mine ・ Lawlers, Western Australia ・ Lawless ・ Lawless (film) ・ Lawless (surname) ・ Lawless (TV series) ・ Lawless and Tilley series ・ Lawless Court ・ Lawless Creek Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Lawler's algorithm ： ウィキペディア英語版 Lawler's algorithm Lawler’s algorithm is a powerful technique for solving a variety of constrained scheduling problems.〔Steven Nahmias. Production and Operations Analysis. 2008. ISBN 978-0-07-126370-2〕 The algorithm handles any precedence constraints. It schedules a set of simultaneously arriving tasks on one processor with precedence constraints to minimize maximum tardiness or lateness. Precedence constraints occur when certain jobs must be completed before other jobs can be started. ==Objective Functions== The objective function is assumed to be in the form $min\; \backslash ,\; max\_\; \backslash ,\; g\_i(F\_i)$, where $g\_i$ is any nondecreasing function and $F\_i$ is the flow time.〔Joseph Y-T. Leung. Handbook of scheduling: algorithms, models, and performance analysis. 2004. ISBN 978-1-58488-397-5〕 When $g\_i\; (F\_i)\; =\; F\_i\; -\; d\_i\; =\; L\_i$, the objective function corresponds to minimizing the maximum lateness, where $d\_i$ is due time for job $i$ and $L\_i$ lateness of job $i$. Another expression is $g\_i\; (F\_i)\; =\; max$, which corresponds to minimizing the maximum tardiness. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Lawler's algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.